The largest cartesian closed category of domains
نویسندگان
چکیده
منابع مشابه
The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains
The inspiration for this paper is a result proved by Michael Smyth which states that Gordon Plotkin's category SFP is the largest cartesian closed category of domains. Although this category is easily enough motivated from concepts in domain theory and category theory, it is clearly harder to describe and less \elementary" than the most popular categories of domains for denotational semantics. ...
متن کاملThe largest Cartesian closed category of domains, considered constructively
A conjecture of Smyth is discussed which says that if D and [D → D] are effectively algebraic directed-complete partial orders with least element (cpo’s), then D is an effectively strongly algebraic cpo, where it was not made precise what is meant by an effectively algebraic and an effectively strongly algebraic cpo. Notions of an effectively strongly algebraic cpo and an effective SFP domain a...
متن کاملThe Largest Cartesian Closed Category of Stable Domains
Berry's category of dI-domains with stable functions is a relatively intricate , yet elegant framework for semantics of programming languages. Despite over fteen years of work in the area, the exact reasons for dis-tributivity (Axiom d) and nitariness (Axiom I) have not been fully ex-plicated. This paper shows that Axiom d and Axiom I are important when one works within the realm of Scott-domai...
متن کاملOn the largest coreflective Cartesian closed subconstruct of Prtop
We show that the subconstruct Fing of Prtop, consisting of all finitely generated pretopological spaces, is the largest Cartesian closed coreflective subeonstmct of Prtop. This implies that in any coreflective subconstruct of Prtop, exponential objects are finitely generated. Moreover, in any finitely productive, coreflective subconstruct, exponential objects are precisely those objects of the ...
متن کاملCartesian closed categories of separable Scott domains
We classify all sub-cartesian closed categories of the category of separable Scott domains. The classification employs a notion of coherence degree determined by the possible inconsistency patterns of sets of finite elements of a domain. Using the classification, we determine all sub-cartesian closed categories of the category of separable Scott domains that contain a universal object. The sepa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90095-6